Μ-recursive function中文什么意思

递归函数

• function:    n. 1.功能，官能，机能，作用。 ...
• recursive function:    递归函数
• basic recursive function theory:    基本递归函数理论

例句与用法

1. Instead , the transformation from tail - recursive function to simple loop must be done dynamically by a jit compiler
   相反地，这种从尾递归函数到简单循环的转换必须由jit编译器动态地进行。
2. But although it is well known how to automatically transform a tail - recursive function into a simple loop , the java specification doesn t require that this transformation be made
   但是，尽管大家都熟知如何把一个尾递归函数自动转换成一个简单循环， java规范却不要求做这种转换。
3. The solution is relatively simple : because these tail - recursive functions are really just easier ways of writing loops , have the compiler automatically transform them to loops
   解决方案比较简单：因为尾递归函数实际上只是编写循环的一种更简单的方式，所以就让编译器把它们自动转换成循环形式。
4. Because of this attribute , there is a nice correspondence between tail - recursive functions and loops : each recursive call can be thought of simply as one more iteration through a loop
   由于这一特点，在尾递归函数和循环之间有一个很好的对应关系：可以简单地把每个递归调用看作是一个循环的多次迭代。

百科释义

In mathematical logic and computer science, the μ-recursive functions are a class of partial functions from natural numbers to natural numbers which are "computable" in an intuitive sense. In fact, in computability theory it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines.